A Survey of Algorithms for Convex Multicommodity Flow Problems
نویسندگان
چکیده
There are many problems related to the design of networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation for this work comes from this problem which is shown to belong to the class of nonlinear convex multicommodity ow problems. This paper emphasizes the message routing problem in data networks, but it includes a broader literature overview of convex multicommodity ow problems. We present and discuss the main solution techniques proposed for solving this class of large-scale convex optimization problems. We conduct some numerical experiments on the message routing problem with some diierent techniques.
منابع مشابه
Solving Quadratic Multicommodity Problems through an Interior-Point Algorithm
Standard interior-point algorithms usually show a poor performance when applied to multicommodity network flows problems. A recent specialized interior-point algorithm for linear multicommodity network flows overcame this drawback, and was able to efficiently solve large and difficult instances. In this work we perform a computational evaluation of an extension of that specialized algorithm for...
متن کاملGlobal scaling of the Proximal Decomposition algorithm for convex multicommodity flow problems
We analyze here the behaviour of the Proximal Decomposition algorithm with global and adaptive scaling. The algorithm is well adapted to solve convex multicommodity flow problems that arise in Network Routing problems with QoS requirements. Numerical tests performed on quadratic models confirm that adaptive global scaling subsumes former scaling strategies with one or many parameters.
متن کاملConvex Multi-commodity Flow Routing
There are many problems related to the design of networks and accommodate demands from different users subject to some constraints on users’ quality of service (QoS) and fairness through the network. The problem of resource allocation and message routing plays a determinant role in the optimization of networks performance. Our work emphasizes the message routing problem in data networks, but it...
متن کاملLocal optimality conditions for multicommodity flow problems with separable piecewise convex costs
We consider here a multicommodity flow network optimization problem with nonconvex but piecewise convex arc cost functions. We derive complete optimality conditions for local minima based on negative-cost cycles associated with each commodity. These conditions do not extend to the convex non-smooth case.
متن کاملConvex Cost Multicommodity Flow Problems: Applications and Algorithms
We review and analyze nonlinear programming approaches to modeling and solving certain flow problems in telecommunications, transportation and supply chain management. We emphasize the common aspects of telecommunications and road networks, and indicate the importance of game theoretic and equilibrium approaches. Algorithms based on the Frank-Wolfe method are developed in depth and their implem...
متن کامل